Reliability function of general classical-Quantum channel

نویسنده

  • Alexander S. Holevo
چکیده

– In information theory the reliability function and its bounds, describing the exponential behavior of the error probability, are important quantitative characteristics of the channel performance. From a more general point of view, these bounds provide certain measures of distinguishability of a given set of classical states. In the paper [3] quantum analogs of the random coding and the expurgation lower bounds for the case of pure signal states were introduced. Here we discuss the case of general quantum states, in particular, we prove the expurgation bound conjectured in [3] and find the quantum cutoff rate for arbitrary mixed signal states.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sphere Packing and Zero-Rate Bounds to the Reliability of Classical-Quantum Channels

In this paper, the sphere packing bound of Fano, Shannon, Gallager and Berlekamp and the zero-rate bound of Berlekamp are extended to general classical-quantum channels. The upper bound for the reliability function obtained from the sphere packing coincides at high rates, for the case of pure state channels, with a lower bound derived by Burnashev and Holevo [21]. Thus, for pure state channels,...

متن کامل

Some properties of quantum reiliablity function for quantum communication channel

This paper presents some examples of quantum reliability function for the quantum communication system in which classical information is transmitted by quantum states. In addition@the quantum Cut off rate is defined. They will be compared with Gallager’s reliability function for the same system.

متن کامل

Teleportation via an Entangled Coherent Channel and Decoherence Effect on This Channel

We study an entangled two-mode coherent state within the framework of2×2-dimensional Hilbert space. We investigate the problem of quantum teleportation ofa superposition coherent state via an entangled coherent channel. By three differentmeasures with the titles ``minimum assured fidelity (MASF)”, ``average teleportationfidelity” and ``optimal fidelity (f)” we study the ...

متن کامل

Se p 19 98 Coding Theorems for Quantum Channels

– The more than thirty years old issue of the (classical) information capacity of quantum communication channels was dramatically clarified during the last years, when a number of direct quantum coding theorems was discovered. The present paper gives a self contained treatment of the subject, following as much in parallel as possible with classical information theory and, on the other side, str...

متن کامل

A Low-rate Bound on the Reliability of a Quantum Discrete Memoryless Channel1

We extend a low-rate improvement of the random coding bound on the reliability of a classical discrete memoryless channel to its quantum counterpart. The key observation that we make is that the problem of bounding below the error exponent for a quantum channel relying on the class of stabilizer codes is equivalent to the problem of deriving error exponents for a certain symmetric classical cha...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 46  شماره 

صفحات  -

تاریخ انتشار 2000